Benjamini-Schramm continuity of root moments of graph polynomials
نویسندگان
چکیده
Abstract. Recently, M. Abért and T. Hubai studied the following problem. The chromatic measure of a finite simple graph is defined to be the uniform distribution on its chromatic roots. Abért and Hubai proved that for a Benjamini-Schramm convergent sequence of finite graphs, the chromatic measures converge in holomorphic moments. They also showed that the normalized log of the chromatic polynomial converges to a harmonic real function outside a bounded disc. In this paper we generalize their work to a wide class of graph polynomials, namely, multiplicative graph polynomials of bounded exponential type. A special case of our results is that for any fixed complex number v0 the measures arising from the Tutte polynomial ZGn(z, v0) converge in holomorphic moments if the sequence (Gn) of finite graphs is Benjamini– Schramm convergent. This answers a question of Abért and Hubai in the affirmative. Even in the original case of the chromatic polynomial, our proof is considerably simpler.
منابع مشابه
Chromatic roots and limits of dense graphs
In this short note we observe that recent results of Abért and Hubai and of Csikvári and Frenkel about Benjamini–Schramm continuity of the holomorphic moments of the roots of the chromatic polynomial extend to the theory of dense graph sequences. We offer a number of problems and conjectures motivated by this observation.
متن کاملOn limits of graphs sphere packed in Euclidean space and applications
The core of this note is the observation that links between circle packings of graphs and potential theory developed in Benjamini and Schramm (2001) [4] and He and Schramm (1995) [11] can be extended to higher dimensions. In particular, it is shown that every limit of finite graphs sphere packed in Rd with a uniformly chosen root is d-parabolic. We then derive a few geometric corollaries. For e...
متن کاملRECURRENCE OF DISTRIBUTIONAL LIMITS OF FINITE PLANAR GRAPHS Itai Benjamini
Suppose that G j is a sequence of finite connected planar graphs, and in each G j a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit G of such graphs. Assume that the vertex degrees of the vertices in G j are bounded, and the bound does not depend on j. Then after passing to a subsequence, the limit exists, and is a random rooted g...
متن کاملZero-free regions of partition functions with applications to algorithms and graph limits
Based on a technique of Barvinok [3, 4, 5] and Barvinok and Soberón [6, 7] we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs. Subsequently we give a quasi-polynomial time approximation scheme for computing these partition functions. As another application we show that the normalised partition functions of these models are cont...
متن کاملRecurrence of Distributional Limits of Finite Planar Graphs
Suppose that Gj is a sequence of finite connected planar graphs, and in each Gj a special vertex, called the root, is chosen randomlyuniformly. We introduce the notion of a distributional limit G of such graphs. Assume that the vertex degrees of the vertices in Gj are bounded, and the bound does not depend on j. Then after passing to a subsequence, the limit exists, and is a random rooted graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 52 شماره
صفحات -
تاریخ انتشار 2016